Counting Pop-Stacked Permutations in Polynomial Time

Permutations that can be sorted greedily by one or more stacks having various constraints have been studied a number of authors. A pop-stack is greedy stack must empty all entries whenever popped. in the image operator are said to pop-stacked. Asinowki, Banderier, Billey, Hackl, and Linusson recently investigated these permutations calculated their up length 16. We give polynomial-time algorithm count pop-stacked fixed we use it compute first 1000 terms corresponding counting sequence. With terms, apply pair computational methods prove some negative results concerning nature generating function for empirically predict asymptotic behavior sequence using differential approximation.